Personalized Queues : the Customer View , via 1 Least - Patient First Routing
نویسنده
چکیده
In personalized queues, information at the level of individuals – customers or servers – is affecting system dynamics. Such information is becoming increasingly accessible, directly or statistically, as exemplified by personalized medicine (customers) or call-center workforce management (servers). In the present work, we take advantage of personalized information about customers, specifically knowledge of their actual (im)patience while waiting to be served. This waiting takes place in a many-server queue that alternates between overand under-loaded periods, hence a fluid view provides a natural modeling framework. This parsimonious view enables us to parameterize and analyze partial information, and consequently calculate and understand the benefits from personalized customer information. We do this by comparing Least-Patience First (LPF) routing (personalized) against FCFS (relatively info-ignorant). One resulting insight is that LPF can provide significant advantages over FCFS when the durations of overloaded periods are comparable to (im)patience times.
منابع مشابه
Personalized queues: the customer view, via a fluid model of serving least-patient first
In personalized queues, information at the level of individuals – customers or servers – is affecting system dynamics. Such information is becoming increasingly accessible, directly or statistically, as exemplified by personalized/precision medicine (customers) or call-center workforce management (servers). In the present work, we take advantage of personalized information about customers, spec...
متن کاملProduct - form in G - networks
The introduction of the class of queueing networks called G-networks by Gelenbe has been a breakthrough in the field of stochastic modelling since it has largely expanded the class of models which are analytically or numerically tractable. From a theoretical point of view, the introduction of the G-networks has lead to very important considerations: first, a product-form queueing network may ha...
متن کاملTwo phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...
متن کاملAlgorithms for Time-Varying Networks of Many-Server Fluid Queues
Motivated by large-scale service systems with network structure and non-exponential customer abandonment, in a previous paper we introduced a non-Markovian time-varying open network of many-server fluid queues with customer abandonment from each queue and timevarying proportional routing among the queues, and showed how performance functions can be determined. The deterministic fluid model serv...
متن کاملA Network of Time-Varying Many-Server Fluid Queues with Customer Abandonment
To describe the congestion in large-scale service systems, we introduce and analyze a non-Markovian open network of many-server fluid queues with customer abandonment, proportional routing and time-varying model elements. A proportion of the fluid completing service at each queue is routed immediately to each other queue, while the fluid not routed to other queues leaves the network. The fluid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014